Opponent Modelling and Commercial Games
نویسندگان
چکیده
To play a game well a player needs to understand the game. To defeat an opponent, it may be sufficient to understand the opponent’s weak spots and to be able to exploit them. In human practice, both elements (knowing the game and knowing the opponent) play an important role. This article focuses on opponent modelling independent of any game. So, the domain of interest is a collection of two-person games, multiperson games, and commercial games. The emphasis is on types and roles of opponent models, such as speculation, tutoring, training, and mimicking characters. Various implementations are given. Suggestions for learning the opponent models are described and their realization is illustrated by opponent models in game-tree search. We then transfer these techniques to commercial games. Here it is crucial for a successful opponent model that the changes of the opponent’s reactions over time are adequately dealt with. This is done by dynamic scripting, an improvised online learning technique for games. Our conclusions are (1) that opponent modelling has a wealth of techniques that are waiting for implementation in actual commercial games, but (2) that the games’ publishers are reluctant to incorporate these techniques since they have no definitive opinion on the successes of a program that is outclassing human beings in strength and creativity, and (3) that game AI has an entertainment factor that is too multifaceted to grasp in reasonable time.
منابع مشابه
IEEE 2005 Symposium on Computational Intelligence and Games CIG ’ 05 April 4 - 6 2005 Essex University , Colchester , Essex , UK
The main difficulty in creating artificial agents is that intelligent behavior is hard to describe. Rules and automata can be used to specify only the most basic behaviors, and feedback for learning is sparse and nonspecific. Intelligent behavior will therefore need to be discovered through interaction with the environment, often through coevolution with other agents. Neuroevolution, i.e. const...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملThe Effectiveness of Opponent Modelling in a Small Imperfect Information Game Contents
Opponent modelling is an important issue in games programming today. Programs which do not perform opponent modelling are unlikely to take full advantage of the mistakes made by an opponent. Additionally, programs which do not adapt over time become less of a challenge to players, causing these players to lose interest. While opponent modelling can be a difficult challenge in perfect informatio...
متن کاملModel-based Opponent Modelling in Domains Beyond the Prisoner’s Dilemma
This paper examines the suitability of the model-based opponent modelling algorithm it-us-l* for domains beyond the prisoner’s dilemma it was initially designed for. An offline modelling framework is constructed where it-us-l* is used to create opponent models whose usage is deferred until a later point in time. This allows evaluation of the modelling procedure in a variety of abstract games – ...
متن کاملEvolving Adaptive Play for the Game of Spoof
For game playing in general it is important for players to be adaptive, this is particularly true for games where no optimal fixed strategy is known to exist. Adaptive artificial opponents capable of learning and opponent modelling are highly desirable in computer games. Typically, a great deal of a game’s ability to maintain the interest of human players is provided by multiplayer functionalit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005